Intelligent Packets for Dynamic Network Routing
نویسندگان
چکیده
A distributed GA (Genetic Algorithm) is designed for the packet switched network routing problem under minimal information, i.e., without information exchange, every node only knows the existence of its neighboring nodes. The requirements of such a problem mean that intelligent packets are required to possess more intelligence than was the norm. To this end a distributed GA approach is developed and benchmarked against the AntNet algorithm under similar information constraints. A profile of AntNet under local and global information is developed with the proposed distributed GA clearly improving on the AntNet algorithm under local information constraints.
منابع مشابه
User-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm
Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...
متن کاملپروتکل مسیریابی خودتطبیقی با محدوده تأخیر برای شبکه های موردی بین خودرویی
Abstract Vehicular Ad Hoc Network (VANET) is a particular type of mobile ad hoc network in which vehicles communicate between themselves using wireless antenna. Due to unique characteristics of VANETs (e.g. high mobility of nodes and dynamic topology), routing is one of the challenging tasks in such networks. Consequently, delay tolerant networks which consider the disconnect nature of...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملAnalysis and Improvement of Content-Aware Routing Mechanisms
Over the past few years, there has been significant interest in content-aware routing that use the information found in the payload of packets to provide intelligent request distribution. As these content-aware routing mechanisms have become an increasingly important building block for Internet service providers, the network behavior and effectiveness of such mechanisms are unclear. In this pap...
متن کاملRouting in Dynamic Network using Ants and Genetic Algorithm
Routing in dynamic network is a challenging one, because the topology of the network is not fixed. This issue is addressed in this presentation using ant algorithm to explore the network using intelligent packets. The paths generated by ants are given as input to genetic algorithm. The genetic algorithm finds the set of optimal routes. The importance of using ant algorithm is to reduce the size...
متن کامل